Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

分层介质系统声透射问题的传递矩阵方法

分层介质中的声透射问题一直是应用声学中的一个棘手问题 ,因为随着层数增加 ,需要求解的方程数目也成比例地增加 ,要按常规方法得到解析表达式几乎不可能 .该文引入传递矩阵的概念使这一问题变得相当简单 ,而且可以很方便地用于程序化处理 ,对于吸声材料的结构设计具有很大的实用价值 .     

基于信息神经网络的内燃机故障诊断方法

在统计概率基础上建立了信息神经网络 ,探讨了利用该网络诊断内燃机故障的方法 ;并在 1 2 1 50L内燃机上进行了模拟故障的诊断试验。试验结果表明 ,该方法是可行的。     

柴油油滴蒸发和燃烧过程的理论计算

提出了柴油油滴蒸发和燃烧过程理论计算方法.对油滴蒸发考虑了不定常蒸发和定常蒸发2个阶段,提出了一个求解蒸发时,油滴直径瞬时变化的代数方程式.对一台直喷式柴油机进行了实例计算,计算得到的瞬时燃烧放热率和气缸压力,与试验值符合很好.     

液体火箭发动机气液同轴式喷嘴混合特性实验研究

本文通过实验研究了液体火箭发动机气液同轴离心式喷嘴的混合特性。利用两相探针技术,测量了喷嘴下游喷雾流场中气液流强和混合比分布,考察了喷嘴缩进比和气液喷注压降等参数对混合特性的影响。结果表明,气液同轴离心式喷嘴的缩进比对喷嘴混合特性有较大影响,增大缩进比将导致更窄的气液流强分布和更均匀的混合,而改变气液喷注压降将导致不同的流强和混合比分布规律。     

液体火箭发动机非线性燃烧不稳定过程的并行仿真

采用计算燃烧学方法对火箭发动机非线性燃烧不稳定工作过程进行了并行数值模拟。气相控制方程组用欧拉坐标系下的Navier Stokes方程组描述 ,液相控制方程组在Lagrangian坐标系下进行描述。气、液两相作用通过方程组的源项互相耦合。编制了串行和并行程序 ,并在并行计算环境下进行了测试。从计算结果可以看出并行计算的效率较高。